The (theta, wheel)-free graphs Part IV: Induced paths and cycles
نویسندگان
چکیده
A hole in a graph is chordless cycle of length at least 4. theta formed by three internally vertex-disjoint paths 2 between the same pair distinct vertices. wheel and node that has 3 neighbors hole. In this series papers we study class graphs do not contain as an induced subgraph nor wheel. Part II prove decomposition theorem for class, uses clique cutsets 2-joins. paper use to solve several problems related finding cycles our class.
منابع مشابه
The (theta, wheel)-free graphs Part II: structure theorem
A hole in a graph is a chordless cycle of length at least 4. A theta is a graph formed by three paths between the same pair of distinct vertices so that the union of any two of the paths induces a hole. A wheel is a graph formed by a hole and a node that has at least 3 neighbors in the hole. In this paper we obtain a decomposition theorem for the class of graphs that do not contain an induced s...
متن کاملThe (theta, wheel)-free graphs Part I: only-prism and only-pyramid graphs
Truemper configurations are four types of graphs (namely thetas, wheels, prisms and pyramids) that play an important role in the proof of several decomposition theorems for hereditary graph classes. In this paper, we prove two structure theorems: one for graphs with no thetas, wheels and prisms as induced subgraphs, and one for graphs with no thetas, wheels and pyramids as induced subgraphs. A ...
متن کاملOn weights of induced paths and cycles in claw-free and K1, r-free graphs
Let G be a K 1;r-free graph (r 3) on n vertices. We prove that, for any induced path or induced cycle on k vertices in G (k 2r ? 1 or k 2r, respectively), the degree sum of its vertices is at most (2r ? 2)(n ?) where is the independence number of G. As a corollary we obtain an upper bound on the length of a longest induced path and a longest induced cycle in a K 1;r-free graph. Stronger bounds ...
متن کاملThe structure of (theta, pyramid, 1-wheel, 3-wheel)-free graphs
In this paper we study the class of graphs C defined by excluding the following structures as induced subgraphs: thetas, pyramids, 1-wheels and 3-wheels. We describe the structure of graphs in C, and we give a polynomial-time recognition algorithm for this class. We also prove that K4-free graphs in C are 4-colorable. We remark that C includes the class of chordal graphs, as well as the class o...
متن کاملInfinite paths in planar graphs IV, dividing cycles
Nash-Williams conjectured that a 4-connected infinite planar graph contains a spanning 2-way infinite path if, and only if, the deletion of any finite set of vertices results in at most two infinite components. In this paper, we prove the Nash-Williams conjecture for graphs with no dividing cycles and for graphs with infinitely many vertex disjoint dividing cycles. A cycle in an infinite plane ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2021
ISSN: ['0095-8956', '1096-0902']
DOI: https://doi.org/10.1016/j.jctb.2020.06.002